Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
نویسندگان
چکیده
منابع مشابه
Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard. In this paper, we present two tabu search implementations, one involving an exhaustive search of the 2-opt neighborhood and the other involving an exhaustive search of the i...
متن کاملTabu search for the single row facility layout problem in FMS using a 3-opt neighborhood
Since material handling agents in a FMS are most efficient when moving in straight lines, a common layout of machines in a FMS is a single row layout. This allows a floor designer to model the problem of generating an optimal machine layout in a FMS as a single row facility layout problem (SRFLP). Due to the computational complexity involved in solving the SRFLP, researchers have developed seve...
متن کاملInsertion based Lin-Kernighan heuristic for single row facility layout
The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is known to be NP-hard. In this paper, we present a neighborhood search heuristic called LK-INSERT which uses a Lin-Kernighan neighborhood structure built on insertion neighborhoods. To...
متن کاملA Hybrid Simulated Annealing algorithm for Single Row Facility Layout Problem
This article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. Regarding the NP-Hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. A number of test problems are randomly generat...
متن کاملA polyhedral approach to the single row facility layout problem
The Single Row Facility Layout Problem (SRFLP) is the NP -hard problem of arranging facilities on a line, while minimizing a weighted sum of the distances between facility pairs. In this paper, a detailed polyhedral study of the SRFLP is performed, and several huge classes of valid and facet-inducing inequalities are derived. Some separation heuristics are presented, along with a primal heurist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2013
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2012.07.037